The concentration of data transfer towards the sink in a wireless sensor network causes nearby nodes exhaust their batteries faster than further nodes, this leaves the sink trapped and disrupts the data reporting communication between sensor nodes. To avoid such scenarios, Protocols with mobile sinks were proposed. They helped in achieving load balancing and uniform energy consumption throughout the network. This research aimed to concentrate on the dynamic requirements of the mobile sink by providing an overview of mobile sink protocol concerns, design requirements, and challenges associated with issues of the mobile sink Routing. On the other hand, in this research different types of mobile sink Protocols are reviewed and compared on the basis of some parameters of the sink protocol. In this paper, the concept of the mobile sink with various Protocols that were defined with the static sink is presented. Mobile sink is supposed to be moving in each round and the data collection is done through Coordinator Cluster Head which collects the data through various cluster heads. Simulation results showed that mobile sink concept is increasing the network lifetime.

In vehicular ad hoc networks there is the ability to communicate between vehicles. This Communication which is wireless should be rapid and reliable. These networks have unique characteristic. This communication among vehicles has many advantages in safety and comfort applications. Since, the roads are always encountered to accidents and risks, using optimized tools could be useful in these situations. In this study, AODV and ADV Routing algorithms has been compared through their performance metrics in a city scenario, include delay, network loss, collision and throughput were investigated through NCTUns 6.0.

In this paper we provide a process algebra to formally analyze ad hoc Protocols above network layer. Mainly our focus in this paper is on formal modeling and analysis of Routing Protocols. We explain the semantics of our algebra using labeled transition systems and then define an equivalence relation between them. Finally we illustrate application of our algebra by a case study on cluster formation process of cluster based ad hoc Routing protocol.